منابع مشابه
Separating Path Systems
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every n-vertex graph admits a separating path system of size O(n) and prove this in certain interesting special cases. In particular, we establish this conjecture for random graphs of all densities and graphs with linear minimum degree. We also obtain tight bounds on the ...
متن کاملSplitting systems and separating systems
Suppose m and t are integers such that 0 < t ≤ m. An (m, t) splitting system is a pair (X,B) where |X| = m, B is a set of bm2 c subsets of X, called blocks such that for every Y ⊆ X and |Y | = t, there exists a block B ∈ B such that |B ∩Y | = b t 2c or |(X \B)∩Y | = b t 2c. We will give some results on splitting systems for t = 2 or 4 which often depend on results from uniform separating system...
متن کاملOn separating systems
We sharpen a result of Hansel on separating set systems. We also extend a theorem of Spencer on completely separating systems by proving an analogue of Hansel’s result.
متن کاملMore on -Separating Systems
The theory of separating systems has been applied in different areas of science and technology such as automata synthesis, technical diagnosis, and authenticating ownership claims. Constructions of (2 2)-separating systems derived from error-correcting codes are given, together with bounds on their parameters based on distance considerations.
متن کاملPinning in phase-separating systems.
We study a dynamical model of a system with two disparate energy scales, and focus on the kinetics of phase separation. In this model, nearest-neighbor monomers can interact with one of two quite distinct energies, thereby describing a system with, e.g. , van der Waals and hydrogen bond interactions. While the model has been described by an efFective Ising model in equilibrium, the nonequilibri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2014
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2014.v5.n3.a4